A random intersection digraph: Indegree and outdegree distributions
نویسنده
چکیده
Let S(1), . . . , S(n), T (1), . . . , T (n) be random subsets of the set [m] = {1, . . . ,m}. We consider the random digraph D on the vertex set [n] defined as follows: the arc i → j is present in D whenever S(i)∩T (j) 6= ∅. Assuming that the pairs of sets (S(i), T (i)), 1 ≤ i ≤ n, are independent and identically distributed, we study the inand outdegree distributions of a typical vertex of D as n,m→∞. key words: random intersection digraph, degree distribution, clustering, random intersection graph
منابع مشابه
Arc-chromatic number of digraphs in which every vertex has bounded outdegree or bounded indegree
A k-digraph is a digraph in which every vertex has outdegree at most k. A (k ∨ l)digraph is a digraph in which a vertex has either outdegree at most k or indegree at most l. Motivated by function theory, we study the maximum value Φ(k) (resp. Φ(k, l)) of the arc-chromatic number over the k-digraphs (resp. (k ∨ l)-digraphs). El-Sahili [3] showed that Φ(k, k) ≤ 2k+1. After giving a simple proof o...
متن کاملDiclique Clustering in a Directed Random Graph
We discuss a notion of clustering for directed graphs, which describes how likely two followers of a node are to follow a common target. The associated network motifs, called dicliques or bi-fans, have been found to be key structural components in various real-world networks. We introduce a two-mode statistical network model consisting of actors and auxiliary attributes, where an actor i decide...
متن کاملOn Directed Triangles in Digraphs
Using a recent result of Chudnovsky, Seymour, and Sullivan, we slightly improve two bounds related to the Caccetta-Haggkvist Conjecture. Namely, we show that if α ≥ 0.35312, then each n-vertex digraph D with minimum outdegree at least αn has a directed 3-cycle. If β ≥ 0.34564, then every n-vertex digraph D in which the outdegree and the indegree of each vertex is at least βn has a directed 3-cy...
متن کاملModulo k in Directed Graphs
We show that every digraph D with minimum outdegree 6 and maximum indegree A contains a directed cycle of length O(mod k), provided e[dd+ l](1-l/k) " < 1. In particular, if A < (2 "-e)/e6 then D contains an even cycle. 0 1989 Academic Press, Inc.
متن کاملEmergence of Scale-Free Close-Knit Friendship Structure in Online Social Networks
Although the structural properties of online social networks have attracted much attention, the properties of the close-knit friendship structures remain an important question. Here, we mainly focus on how these mesoscale structures are affected by the local and global structural properties. Analyzing the data of four large-scale online social networks reveals several common structural properti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Mathematics
دوره 310 شماره
صفحات -
تاریخ انتشار 2010